Generalized Maneuvers in Route Planning
نویسندگان
چکیده
We study an important practical aspect of the route planning problem in real-world road networks – maneuvers. Informally, maneuvers represent various irregularities of the road network graph such as turnprohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers, and outline how to enhance Dijkstra’s algorithm in order to solve route planning queries in this model without prior adjustments of the underlying road network graph.
منابع مشابه
ar X iv : 1 10 7 . 07 98 v 2 [ cs . D S ] 1 9 A ug 2 01 1 Generalized Maneuvers in Route Planning
We study an important practical aspect of the route planning problem in real-world road networks – maneuvers. Informally, maneuvers represent various irregularities of the road network graph such as turnprohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers, and outline how...
متن کاملGeneralized Maneuvers in Route Planning for Computing and Informatics
We study an important practical aspect of the route planning problem in real-world road networks – maneuvers. Informally, maneuvers represent various irregularities of the road network graph such as turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers and extend trad...
متن کاملTRANSPORT ROUTE PLANNING MODELS BASED ON FUZZY APPROACH
Transport route planning is one of the most important and frequent activities in supply chain management. The design of information systems for route planning in real contexts faces two relevant challenges: the complexity of the planning and the lack of complete and precise information. The purpose of this paper is to nd methods for the development of transport route planning in uncertainty dec...
متن کاملThe Time Dependent Traveling Salesman Planning Problem in Controlled Airspace
The integration of drones into civil airspace is one of the most challenging problems for the automation of the controlled airspace, and the optimization of the drone route is a key step for this process. In this paper, we optimize the route planning of a drone mission that consists of departing from an airport, flying over a set of mission way points and coming back to the initial airport. We ...
متن کاملOptimal Sliding-Mode Guidance Law for Fixed-Interval Propulsive Maneuvers
An optimal strategy based on minimum effort control and also with terminal positionconstraint is developed for an exoatmospheric interceptor with a fixed- interval guidance time. It isthen integrated with sliding-mode control theory to drive an optimal sliding-mode guidance law forfixed-interval guidance time. In addition, this guidance law is generalized for intercepting anarbitrarily time-var...
متن کامل